Dimensional approximation in dynamic programming by structural decomposition
نویسندگان
چکیده
منابع مشابه
Stable Function Approximation in Dynamic Programming
The success of reinforcement learning in practical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experiments in this area have produced mixed results; there have been both notable successes and notable disappointments. Theory has been scarce, mostly due to the difculty of reasoning about function approximators that gen...
متن کاملNonserial dynamic programming and local decomposition algorithms in discrete programming
One of perspective ways to exploit sparsity in the dependency graph of an optimization problem is nonserial dynamic programming (NSDP) which allows to compute solution in stages, each of them uses results from previous stages. The class of discrete optimization problems with the block-tree matrix of constraints is considered. Nonserial dynamic programming (NSDP) algorithm for the solution of th...
متن کاملFinite dimensional approximation in infinite dimensional mathematical programming
We consider the problem of approximating an optimal solution to a separable, doubly infinite mathematical program (P) with lower staircase structure by solutions to the programs (P(N)) obtained by truncating after the first N variables and N constraints of (P). Viewing the surplus vector variable associated with the Nth constraint as a state, and assuming that all feasible states are eventually...
متن کاملLow-rank Approximation and Dynamic Mode Decomposition
Dynamic Mode Decomposition (DMD) has emerged as a powerful tool for analyzing the dynamics of non-linear systems from experimental datasets. Recently, several attempts have extended DMD to the context of low-rank approximations. This low-rank extension takes the form of a nonconvex optimisation problem. To the best of our knowledge, only sub-optimal algorithms have been proposed in the literatu...
متن کاملSolving dynamic stochastic economic models by mathematical programming decomposition methods
Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic problems are still quite challenging to solve. Economists are aware of the limitations of some of these approaches for solving these problems due to memory and computational requirements. However, many of the economic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1970
ISSN: 0022-247X
DOI: 10.1016/0022-247x(70)90168-x